Oeritte: User-Friendly Counterexample Explanation for Model Checking
نویسندگان
چکیده
Thorough verification is a part of the design process instrumentation and control systems if they must comply with crucial safety requirements. Model checking can be applied to formal model such system reason about its correctness based on specification provided. When violation occurs, tool outputs proof in form failure trace, which represents state sequence transitions where requirement does not hold. This sequence, however, even for modular systems, mere table values. Due lack any insights into inner processes structures that caused problem, debugging becomes time effort consuming. The presented this paper, Oeritte, aimed at assisting analyst challenge. It implements method automatic visual counterexample explanation includes reasoning both over falsified LTL formula NuSMV function block diagram system. an industrial-sized nuclear power plant.
منابع مشابه
Counterexample-Driven Model Checking
The generation of counterexamples is frequently touted as one of the primary advantages of model checking as a verification technique. However, the generation of trace-like counterexamples is limited to a small fragment of branching-time temporal logic. When model checking does succeed in verifying a property, there is typically no independently checkable witness that can be used as evidence fo...
متن کاملA User-friendly Tool for Model Checking Healthcare Workflows
Workflow management tools may be used in many domains, to guide and direct processes, to support monitoring activities and to increase organizational efficiency. In safety critical applications such as healthcare, it is essential that the workflow is error-free, that is, for every run of the workflow, necessary requirements are satisfied and unwanted situations do not occur. However, most tools...
متن کاملCounterexample-Preserving Reduction for Symbolic Model Checking
The cost of LTL model checking is highly sensitive to the length of the formula under verification. We observe that, under some specific conditions, the input LTL formula can be reduced to an easier-tohandle one before model checking. In our reduction, these two formulae need not to be logically equivalent, but they share the same counterexample set w.r.t the model. In the case that the model i...
متن کاملCounterexample Explanation in Divine Model-checker
The thesis focuses on counterexample explanation in model checking, which aims to provide useful information about the cause of an error so that the system designer can find and fix the error faster. We summarize some of the existing methods to deal with this problem and implement the method of Alex Groce and Willem Visser. This method describes three ways of comparing failing and unfailing run...
متن کاملDistributed CTL Model-Checking and counterexample search
In this paper, we propose a distributed algorithm for CTL model-checking and a counterexample search whenever the CTL formula is not satisfied. The distributed approach is used in order to cope with the state space explosion problem. A cluster of workstations performs collaborative verification over a partitioned state space. Thus, every process involved in the distributed verification executes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2021.3073459